A Best-First Search Algorithm for Generating Referring Expressions

نویسنده

  • Helmut Horacek
چکیده

Existing algorithms for generating referential descriptions to sets of objects have serious deficits: while incremental approaches may produce ambiguous and redundant expressions, exhaustive searches are computationally expensive. Mediating between these extreme control regimes, we propose a best-first searching algorithm for uniquely identifying sets of objects. We incorporate linguistically motivated preferences and several techniques to cut down the search space. Preliminary results show the effectiveness of the new algorithm.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Generating Referential Descriptions Involving Relations by a Best-First Searching Procedure - A System Demo

Despite considerable research invested in the generation of referring expressions (GRE), there still exists no adequate generic procedure for GRE involving relations. In this paper, we present a system for GRE that combines attributes and relations, using best-first search technique. Preliminary evaluations show its effectiveness; the design enables the use of heuristics that meet linguistic pr...

متن کامل

A System for Generating Descriptions of Sets of Objects in a Rich variety

Even ambitious algorithms for the generation of referring expressions that identify sets of objects are restricted in terms of efficiency or in their expressive repertoire. In this paper, we report on a system that applies a best-first searching procedure, enhancing both its effectiveness and the variety of expressions it can generate.

متن کامل

Generating referring expressions with a cognitive model

The low computational cost of the incremental algorithm for generating referring expressions makes it an interesting starting point for a cognitive model. But the algorithm has a very limited cognitive adequacy; first of all because of the fact that the preference list (the order in which features are considered for inclusion in the referring expression) is fixed. This means the algorithm does ...

متن کامل

Generating Referring Expressions in Open Domains

We present an algorithm for generating referring expressions in open domains. Existing algorithms work at the semantic level and assume the availability of a classification for attributes, which is only feasible for restricted domains. Our alternative works at the realisation level, relies on WordNet synonym and antonym sets, and gives equivalent results on the examples cited in the literature ...

متن کامل

Generating Referring Expressions: Making Referents Easy to Identify

It is often desirable that referring expressions be chosen in such a way that their referents are easy to identify. This article focuses on referring expressions in hierarchically structured domains, exploring the hypothesis that referring expressions can be improved by including logically redundant information in them if this leads to a significant reduction in the amount of search that is nee...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2003